The H-index of a network node and its relation to degree and coreness
نویسندگان
چکیده
Identifying influential nodes in dynamical processes is crucial in understanding network structure and function. Degree, H-index and coreness are widely used metrics, but previously treated as unrelated. Here we show their relation by constructing an operator , in terms of which degree, H-index and coreness are the initial, intermediate and steady states of the sequences, respectively. We obtain a family of H-indices that can be used to measure a node's importance. We also prove that the convergence to coreness can be guaranteed even under an asynchronous updating process, allowing a decentralized local method of calculating a node's coreness in large-scale evolving networks. Numerical analyses of the susceptible-infected-removed spreading dynamics on disparate real networks suggest that the H-index is a good tradeoff that in many cases can better quantify node influence than either degree or coreness.
منابع مشابه
The Application of Complex Networks Analysis to Assess Iran's Trade and It's Most Important Trading Partners in Asia
The existing trade models suggest that for tradable goods potential partners can be many, but eventually only one (the one offering the best price) should be selected, therefore relatively few (unidirectional) trade links will appear between countries. If the structure of international trade flows describes as a network, trade link would give rise between countries. This paper exploit recently-...
متن کاملLeveraging local h-index to identify and rank influential spreaders in networks
Identifying influential nodes in complex networks has received increasing attention for its great theoretical and practical applications in many fields. Some classical methods, such as degree centrality, betweenness centrality, closeness centrality, and coreness centrality, were reported to have some limitations in detecting influential nodes. Recently, the famous h-index was introduced to the ...
متن کاملBrief Announcement: Distributed k–Core Decomposition∗
In the last few years, a number of metrics and methods have been introduced for studying the relative “importance” of nodes within complex network structures [6]. Among these metrics, k-core decomposition is a well-established method for identifying particular subsets of the graph called k-cores, or k-shells [7]. Informally, a k-core is obtained by recursively removing all nodes of degree small...
متن کاملDecentralized Routing and Power Allocation in FDMA Wireless Networks based on H∞ Fuzzy Control Strategy
Simultaneous routing and resource allocation has been considered in wireless networks for its performance improvement. In this paper we propose a cross-layer optimization framework for worst-case queue length minimization in some type of FDMA based wireless networks, in which the the data routing and the power allocation problem are jointly optimized with Fuzzy distributed H∞ control strategy ....
متن کاملThe Influence of Location on Nodes’ Centrality in Location-Based Social Networks
Nowadays, due to the widespread use of social networks, they can be used as a convenient, low-cost, and affordable tool for disseminating all kinds of information and data among the massive users of these networks. Issues such as marketing for new products, informing the public in critical situations, and disseminating medical and technological innovations are topics that have been considered b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 7 شماره
صفحات -
تاریخ انتشار 2016